664A - Complicated GCD - CodeForces Solution

math number theory *800

Please click on ads to support us..

Python Code: 

a, b = map(str, input().split())
if a==b:
    print(a)
else:
    print("1")

C++ Code: 

#include<bits/stdc++.h>
using namespace std;
int main()
{
     string s1,s2;
     cin>>s1>>s2;
     if(s1==s2)cout<<s1<<endl;
     else cout<<1<<endl;
}


Comments

Submit
0 Comments
More Questions

1436A - Reorder
1363C - Game On Leaves
1373C - Pluses and Minuses
1173B - Nauuo and Chess
318B - Strings of Power
1625A - Ancient Civilization
864A - Fair Game
1663B - Mike's Sequence
448A - Rewards
1622A - Construct a Rectangle
1620A - Equal or Not Equal
1517A - Sum of 2050
620A - Professor GukiZ's Robot
1342A - Road To Zero
1520A - Do Not Be Distracted
352A - Jeff and Digits
1327A - Sum of Odd Integers
1276A - As Simple as One and Two
812C - Sagheer and Nubian Market
272A - Dima and Friends
1352C - K-th Not Divisible by n
545C - Woodcutters
1528B - Kavi on Pairing Duty
339B - Xenia and Ringroad
189A - Cut Ribbon
1182A - Filling Shapes
82A - Double Cola
45A - Codecraft III
1242A - Tile Painting
1663E - Are You Safe